Higher-order iterative methods for approximating zeros of analytic functions
نویسندگان
چکیده
منابع مشابه
Newton-type iterative methods for finding zeros having higher multiplicity
Abstract: In this paper, using the idea of Gander, families of several iterative methods for solving non-linear equations f (x) = 0 having zeros of higher multiplicity are presented. The families of methods presented here include methods of Newton type, Steffensen type and their variant. We obtain families of methods of order 2 as well as 3. Some numerical examples are also presented in support...
متن کاملZeros of Random Analytic Functions
Zeros of Random Analytic Functions The dominant theme of this thesis is that random matrix valued analytic functions, generalizing both random matrices and random analytic functions, for many purposes can (and perhaps should) be effectively studied in that level of generality. We study zeros of random analytic functions in one complex variable. It is known that there is a one parameter family o...
متن کاملA Third Order Iterative Method for Finding Zeros of Nonlinear Equations
In this paper, we present a new modification of Newton's method for finding a simple root of a nonlinear equation. It has been proved that the new method converges cubically.
متن کاملHigh order quadrature based iterative method for approximating the solution of nonlinear equations
In this paper, weight function and composition technique is utilized to speeds up the convergence order and increase the efficiency of an existing quadrature based iterative method. This results in the proposition of its improved form from a two-point quadrature based method of convergence order ρ = 3 with efficiency index EI = 1:3161 to a three-point method of convergence order ρ = 8 with EI =...
متن کاملOptimal information for approximating periodic analytic functions
Let Sβ := {z ∈ C : | Im z| < β} be a strip in the complex plane. For fixed integer r ≥ 0 let Hr ∞,β denote the class of 2π-periodic functions f , which are analytic in Sβ and satisfy |f(r)(z)| ≤ 1 in Sβ . Denote by Hr,R ∞,β the subset of functions from Hr ∞,β that are real-valued on the real axis. Given a function f ∈ Hr ∞,β , we try to recover f(ζ) at a fixed point ζ ∈ R by an algorithm A on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90133-i